package hot;

/**
 * @author way
 * @create 2025-03-15 18:49
 */
public class _153_findMin {
    public int findMin(int[] nums) {
        int l = 0, r = nums.length - 1;
        while (l < r) {
            int mid = l + (r - l) / 2;
            if (nums[mid] < nums[r]) r = mid ;
            else                     l = mid + 1;
        }
        return nums[l];
    }
}
